Stochastic and Dynamic Routing Problems for multiple UAVs

Consider a routing problem for a team of vehicles in the plane: target points appear randomly over time in a bounded environment and must be visited by one of the vehicles. It is desired to minimize the expected system time for the targets, i.e., the expected time elapsed between the appearance of a target point, and the instant it is visited. In this paper, such a routing problem is considered for a team of Uninhabited Aerial Vehicles (UAVs), modeled as vehicles moving with constant forward speed along paths of bounded curvature. Three algorithms are presented, each designed for a distinct set of operating conditions. Each is proven to provide a system time within a constant factor of the optimal when operating under the appropriate conditions. It is shown that the optimal routing policy depends on problem parameters such as the workload per vehicle and the vehicle density in the environment. Finally, there is discussion of a phase transition between two of the policies as the problem parameters are varied. In particular, for the case in which targets appear sporadically, a dimensionless parameter is identified which completely captures this phase transition and an estimate of the critical value of the parameter is provided. ∗Algorithm Designer, Kiva Research Team, [email protected]. AIAA Member. †Postdoctoral Associate, Laboratory for Information and Decision Systems, [email protected]. AIAA Member. ‡Associate Professor, Laboratory for Information and Decision Systems, Aeronautics and Astronautics Department, [email protected]. AIAA Senior Member. §Professor, Mechanical Engineering Department and the Center for Control, Dynamical Systems and Computation, [email protected].